// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
struct pos
{
	int x,c;
	pos(int xx,int cc)
	{
		x=xx,c=cc;
	}
};
signed main()
{
	int n;
	cin>>n;
	queue<pos> q;
	vector<bool> vis(n+1);
	q.push(pos(1,0));
	while(!q.empty())
	{
		pos tmp=q.front();
		q.pop();
		int x=tmp.x,c=tmp.c;
		if(x<1||x>n||vis[x]!=0)continue;
		vis[x]=1;
		if(x==n)
		{
			cout<<c;
			return 0;
		}
		q.push(pos(x+1,c+1));
		q.push(pos(x-1,c+1));
		q.push(pos(x*2,c+1));
	}
	return 0;
}
